Using constraint preconditioners with regularized saddle-point problems
نویسندگان
چکیده
منابع مشابه
Using constraint preconditioners with regularized saddle-point problems
The problem of finding good preconditioners for the numerical solution of a certain important class of indefinite linear systems is considered. These systems are of a 2 by 2 block structure in which the (2,2) block (denoted by −C) is assumed to be nonzero. In Constraint preconditioning for indefinite linear systems, SIAM J. Matrix Anal. Appl., 21 (2000), Keller, Gould and Wathen introduced the ...
متن کاملThe University of Reading Department of Mathematics Constraint-style preconditioners for regularized saddle point problems
The problem of finding good preconditioners for the numerical solution of an important class of indefinite linear systems is considered. These systems are of a regularized saddle point structure [ A B B −C ] [ x y ] = [ c d ] , where A ∈ Rn×n, C ∈ Rm×m are symmetric and B ∈ Rm×n. In Constraint preconditioning for indefinite linear systems, SIAM J. Matrix Anal. Appl., 21 (2000), Keller, Gould an...
متن کاملParallel Inexact Constraint Preconditioners for Saddle Point Problems
In this paper we propose a parallel implementation of the FSAI preconditioner to accelerate the PCG method in the solution of symmetric positive definite linear systems of very large size. This preconditioner is used as building block for the construction of an indefinite Inexact Constraint Preconditioner (ICP) for saddle point-type linear systems arising from Finite Element (FE) discretization...
متن کاملPreconditioners for regularized saddle point problems with an application for heterogeneous Darcy flow problems
Saddle point problems arise in the modelling of many important practical problems. Preconditioners for the corresponding matrices on block triangular form, based on coupled inner-outer iteration methods are analyzed and applied to a Darcy flow problem, possibly with strong heterogeneity and to non-symmetric saddle point problems. Using proper regularized forms of the given matrix and its precon...
متن کاملPreconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2007
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-006-9004-x